Conjugacy in Houghton’s Groups
نویسنده
چکیده
Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for Hn, n ≥ 2. 2010 Mathematics Subject Classification: Primary: 20F10, 20B99.
منابع مشابه
Commensurations and Metric Properties of Houghton’s Groups
We describe the automorphism groups and the abstract commensurators of Houghton’s groups. Then we give sharp estimates for the word metric of these groups and deduce that the commensurators embed into the corresponding quasi-isometry groups. As a further consequence, we obtain that the Houghton group on two rays is at least quadratically distorted in those with three or more rays.
متن کاملGroups whose set of vanishing elements is exactly a conjugacy class
Let $G$ be a finite group. We say that an element $g$ in $G$ is a vanishing element if there exists some irreducible character $chi$ of $G$ such that $chi(g)=0$. In this paper, we classify groups whose set of vanishing elements is exactly a conjugacy class.
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کامل